A Tableaux Calculus for Reducing Proof Size
نویسندگان
چکیده
A tableau calculus is proposed, based on a compressed representation of clauses, where literals sharing a similar shape may be merged. The inferences applied on these literals are fused when possible, which reduces the size of the proof. It is shown that the obtained proof procedure is sound, refutationally complete and allows to reduce the size of the tableau by an exponential factor. The approach is compatible with all usual refinements of tableaux.
منابع مشابه
Accelerating Tableaux Proofs Using Compact Representations
In this article a modiied form of tableau calculus, called Tableau Graph Calculus, is presented for overcoming the well-known ineeciencies of the traditional tableau calculus to a large extent. This calculus is based on a compact representation of analytic tableaux by using graph structures called tableau graphs. These graphs are obtained from the input formula in linear time and incorporate mo...
متن کاملA Model Generation Style Completeness Proof for Constraint Tableaux with Superposition
We present a calculus that integrates equality handling by superposition into a free variable tableau calculus. We prove completeness of this calculus by an adaptation of the model generation [1, 15] technique commonly used for completeness proofs of resolution calculi. The calculi and the completeness proof are compared to earlier results of Degtyarev and Voronkov [7].
متن کاملRigid Hypertableaux
This paper extends a calculus for rst-order logic that combines the inference mechanism of hyperresolution with the more informative structure of analytic tableaux and that has been introduced as hyper tableaux by Baumgartner et al. (1996). This clausal tableau calculus is proof connuent, but suuers from the need of partial ground instantia-tions. I will develop an improvement of hyper tableaux...
متن کاملTableau Proof Systems for Justification Logics
In this paper we present tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give a syntactic proof of cut elimination. We also show the subformula property for our tableaux.
متن کاملTowards a Theory of Proofs of Classical Logic
The questions “What is a proof?” and “When are two proofs the same?” are fundamentalfor proof theory. But for the most prominent logic, Boolean (or classical) propositionallogic, we still have no satisfactory answers.This is embarrassing not only for proof theory itself, but also for computer science,where classical propositional logic plays a major role in automated reasoning a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.04163 شماره
صفحات -
تاریخ انتشار 2018